#include<bits/stdc++.h>
#define eb emplace_back
#define ep emplace

using namespace std;
using ll = long long;
constexpr int N = 1e5 + 5;

int n, a[N];

int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i = 1; i <= n; ++ i) cin >> a[i];
    sort(a + 1, a + n + 1);
    
    priority_queue<int> q;

    for(int i = 1; i <= n; ++ i) {
        if(!q.empty() && -q.top() < a[i]) q.pop();
        q.push(-a[i]);
    }
    cout << q.size();
    return 0;
}